The Complexity of Unions of Disjoint Sets
نویسندگان
چکیده
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of their single components. More precisely, they are complete with respect to more general reducibilities. Moreover, we approach the main question in a more general way: We analyze the scope of the complexity of unions of m-equivalent disjoint sets. Under the hypothesis that NE 6= coNE, we construct degrees in NP where our main question has a positive answer, i.e., these degrees are closed under unions of disjoint sets.
منابع مشابه
The Informational Content of Canonical Disjoint NP-Pairs
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between their canonical pairs. We focus on the opposite direction and study the following questions. Q1: Where does the implication [can(f) ≤ m can(g) ⇒ f ≤s g] hold, and where does it fail? Q2: Where can we find proof systems of...
متن کاملExamples of non-quasicommutative semigroups decomposed into unions of groups
Decomposability of an algebraic structure into the union of its sub-structures goes back to G. Scorza's Theorem of 1926 for groups. An analogue of this theorem for rings has been recently studied by A. Lucchini in 2012. On the study of this problem for non-group semigroups, the first attempt is due to Clifford's work of 1961 for the regular semigroups. Since then, N.P. Mukherjee in 1972 studied...
متن کاملDisjoint-union partial algebras
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are defined. We provide a recursive first-order axiomatisation of the class of partial algebras isomorphic to a disjointunion partial algebra of sets but prove that ...
متن کاملDescriptive complexity of countable unions of Borel rectangles
We give, for each countable ordinal ξ ≥ 1, an example of a ∆2 countable union of Borel rectangles that cannot be decomposed into countably many Πξ rectangles. In fact, we provide a graph of a partial injection with disjoint domain and range, which is a difference of two closed sets, and which has no ∆ξ-measurable countable coloring. 2010 Mathematics Subject Classification. Primary: 03E15, Secon...
متن کاملThe Bounded Injury Priority Method and the Learnability of Unions of Rectangles
We develop a bounded version of the nite injury priority method in recursion theory. We use this to study the learnability of unions of rectangles over the domain f0; : : :; n? 1g d with only equivalence queries. Applying this method, we show three main results: (1) The class of unions of rectangles is polynomial time learnable for constant dimension d. (2) The class of unions of rectangles who...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 74 شماره
صفحات -
تاریخ انتشار 2006